ReP USP - Resultado da busca

Artigo de periodico
Essentially infinite colourings of hypergraphs (2007)
Bollobás, Béla ; Kohayakawa, Yoshiharu ; Rodl, Vojtech; Schacht, Mathias; Taraz, Anusch
Source: Proceedings of the London Mathematical Society. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla et al. Essentially infinite colourings of hypergraphs. Proceedings of the London Mathematical Society, v. 95, n. 3, p. 709-734, 2007Tradução . . Disponível em: https://doi.org/10.1112/plms/pdm024. Acesso em: 27 abr. 2024.
APA
Bollobás, B., Kohayakawa, Y., Rodl, V., Schacht, M., & Taraz, A. (2007). Essentially infinite colourings of hypergraphs. Proceedings of the London Mathematical Society, 95( 3), 709-734. doi:10.1112/plms/pdm024
NLM
Bollobás B, Kohayakawa Y, Rodl V, Schacht M, Taraz A. Essentially infinite colourings of hypergraphs [Internet]. Proceedings of the London Mathematical Society. 2007 ; 95( 3): 709-734.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1112/plms/pdm024
Vancouver
Bollobás B, Kohayakawa Y, Rodl V, Schacht M, Taraz A. Essentially infinite colourings of hypergraphs [Internet]. Proceedings of the London Mathematical Society. 2007 ; 95( 3): 709-734.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1112/plms/pdm024
Artigo de periodico-carta/editorial
Special issue on Ramsey theory. [Editorial] (2003)
Bollobás, Béla ; Brightwell, Graham R; Kohayakawa, Yoshiharu ; Leader, Imre; Scott, Alexander D.
Source: Combinatorics, Probability & Computing. Unidade: IME
Assunto: TEORIA DE RAMSEY
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla et al. Special issue on Ramsey theory. [Editorial]. Combinatorics, Probability & Computing. Cambridge: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1017/S0963548303005777. Acesso em: 27 abr. 2024. , 2003
APA
Bollobás, B., Brightwell, G. R., Kohayakawa, Y., Leader, I., & Scott, A. D. (2003). Special issue on Ramsey theory. [Editorial]. Combinatorics, Probability & Computing. Cambridge: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1017/S0963548303005777
NLM
Bollobás B, Brightwell GR, Kohayakawa Y, Leader I, Scott AD. Special issue on Ramsey theory. [Editorial] [Internet]. Combinatorics, Probability & Computing. 2003 ; 12( 5-6): 467.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1017/S0963548303005777
Vancouver
Bollobás B, Brightwell GR, Kohayakawa Y, Leader I, Scott AD. Special issue on Ramsey theory. [Editorial] [Internet]. Combinatorics, Probability & Computing. 2003 ; 12( 5-6): 467.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1017/S0963548303005777
Artigo de periodico
Ramsey minimal graphs (2001)
Bollobás, Béla ; Donadelli Junior, Jair ; Kohayakawa, Yoshiharu ; Schelp, Richard H.
Source: Journal of the Brazilian Computer Society. Unidade: IME
Assunto: TEORIA DE RAMSEY
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla et al. Ramsey minimal graphs. Journal of the Brazilian Computer Society, v. 7, n. 3, p. 27-37, 2001Tradução . . Disponível em: https://doi.org/10.1590/S0104-65002001000200005. Acesso em: 27 abr. 2024.
APA
Bollobás, B., Donadelli Junior, J., Kohayakawa, Y., & Schelp, R. H. (2001). Ramsey minimal graphs. Journal of the Brazilian Computer Society, 7( 3), 27-37. doi:10.1590/S0104-65002001000200005
NLM
Bollobás B, Donadelli Junior J, Kohayakawa Y, Schelp RH. Ramsey minimal graphs [Internet]. Journal of the Brazilian Computer Society. 2001 ; 7( 3): 27-37.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1590/S0104-65002001000200005
Vancouver
Bollobás B, Donadelli Junior J, Kohayakawa Y, Schelp RH. Ramsey minimal graphs [Internet]. Journal of the Brazilian Computer Society. 2001 ; 7( 3): 27-37.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1590/S0104-65002001000200005
Artigo de periodico
Essentially infinite colourings of graphs (2000)
Bollobás, Béla ; Kohayakawa, Yoshiharu ; Schelp, Richard H.
Source: Journal of the London Mathematical Society. Second Series. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu e SCHELP, Richard H. Essentially infinite colourings of graphs. Journal of the London Mathematical Society. Second Series, v. 61, n. 3, p. 658-670, 2000Tradução . . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1112/S0024610700008796. Acesso em: 27 abr. 2024.
APA
Bollobás, B., Kohayakawa, Y., & Schelp, R. H. (2000). Essentially infinite colourings of graphs. Journal of the London Mathematical Society. Second Series, 61( 3), 658-670. doi:10.1112/S0024610700008796
NLM
Bollobás B, Kohayakawa Y, Schelp RH. Essentially infinite colourings of graphs [Internet]. Journal of the London Mathematical Society. Second Series. 2000 ; 61( 3): 658-670.[citado 2024 abr. 27 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1112/S0024610700008796
Vancouver
Bollobás B, Kohayakawa Y, Schelp RH. Essentially infinite colourings of graphs [Internet]. Journal of the London Mathematical Society. Second Series. 2000 ; 61( 3): 658-670.[citado 2024 abr. 27 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1112/S0024610700008796
Parte de monografia/livro
On Richardson's model on the hypercube (1997)
Bollobás, Béla ; Kohayakawa, Yoshiharu
Source: Combinatorics, geometry and probability : a tribute to Paul Erdos. Unidade: IME
Assunto: COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu. On Richardson's model on the hypercube. Combinatorics, geometry and probability : a tribute to Paul Erdos. Tradução . Cambridge: Cambridge University Press, 1997. . Disponível em: https://doi.org/10.1017/CBO9780511662034.015. Acesso em: 27 abr. 2024.
APA
Bollobás, B., & Kohayakawa, Y. (1997). On Richardson's model on the hypercube. In Combinatorics, geometry and probability : a tribute to Paul Erdos. Cambridge: Cambridge University Press. doi:10.1017/CBO9780511662034.015
NLM
Bollobás B, Kohayakawa Y. On Richardson's model on the hypercube [Internet]. In: Combinatorics, geometry and probability : a tribute to Paul Erdos. Cambridge: Cambridge University Press; 1997. [citado 2024 abr. 27 ] Available from: https://doi.org/10.1017/CBO9780511662034.015
Vancouver
Bollobás B, Kohayakawa Y. On Richardson's model on the hypercube [Internet]. In: Combinatorics, geometry and probability : a tribute to Paul Erdos. Cambridge: Cambridge University Press; 1997. [citado 2024 abr. 27 ] Available from: https://doi.org/10.1017/CBO9780511662034.015
Artigo de periodico
Connectivity properties of random subgraphs of the cube (1995)
Bollobás, Béla ; Kohayakawa, Yoshiharu ; Luczak, Tomasz
Source: Random Structures and Algorithms. Unidade: IME
Subjects: COMBINATORIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu e LUCZAK, Tomasz. Connectivity properties of random subgraphs of the cube. Random Structures and Algorithms, v. 6, n. 2-3, p. 221-230, 1995Tradução . . Disponível em: https://doi-org.ez67.periodicos.capes.gov.br/10.1002/rsa.3240060210. Acesso em: 27 abr. 2024.
APA
Bollobás, B., Kohayakawa, Y., & Luczak, T. (1995). Connectivity properties of random subgraphs of the cube. Random Structures and Algorithms, 6( 2-3), 221-230. doi:10.1002/rsa.3240060210
NLM
Bollobás B, Kohayakawa Y, Luczak T. Connectivity properties of random subgraphs of the cube [Internet]. Random Structures and Algorithms. 1995 ; 6( 2-3): 221-230.[citado 2024 abr. 27 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1002/rsa.3240060210
Vancouver
Bollobás B, Kohayakawa Y, Luczak T. Connectivity properties of random subgraphs of the cube [Internet]. Random Structures and Algorithms. 1995 ; 6( 2-3): 221-230.[citado 2024 abr. 27 ] Available from: https://doi-org.ez67.periodicos.capes.gov.br/10.1002/rsa.3240060210
Artigo de periodico
An extension of the Erdős-Stone theorem (1994)
Bollobás, Béla ; Kohayakawa, Yoshiharu
Source: Combinatorica. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu. An extension of the Erdős-Stone theorem. Combinatorica, v. 14, n. 3, p. 279-286, 1994Tradução . . Disponível em: https://doi.org/10.1007/bf01212976. Acesso em: 27 abr. 2024.
APA
Bollobás, B., & Kohayakawa, Y. (1994). An extension of the Erdős-Stone theorem. Combinatorica, 14( 3), 279-286. doi:10.1007/bf01212976
NLM
Bollobás B, Kohayakawa Y. An extension of the Erdős-Stone theorem [Internet]. Combinatorica. 1994 ; 14( 3): 279-286.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/bf01212976
Vancouver
Bollobás B, Kohayakawa Y. An extension of the Erdős-Stone theorem [Internet]. Combinatorica. 1994 ; 14( 3): 279-286.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1007/bf01212976
Trabalho de evento
On the evolution of random boolean functions (1994)
Bollobás, Béla ; Kohayakawa, Yoshiharu ; Luczak, T
Source: Proceedings. Conference titles: Conference Extremal Problems for Finite Sets. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu e LUCZAK, T. On the evolution of random boolean functions. 1994, Anais.. Budapest: János Bolyai Mathematical Society, 1994. Disponível em: https://www.tib.eu/en/search/id/BLCP%3ACN015367308/On-the-evolution-of-Random-Boolean-Functions/. Acesso em: 27 abr. 2024.
APA
Bollobás, B., Kohayakawa, Y., & Luczak, T. (1994). On the evolution of random boolean functions. In Proceedings. Budapest: János Bolyai Mathematical Society. Recuperado de https://www.tib.eu/en/search/id/BLCP%3ACN015367308/On-the-evolution-of-Random-Boolean-Functions/
NLM
Bollobás B, Kohayakawa Y, Luczak T. On the evolution of random boolean functions [Internet]. Proceedings. 1994 ;[citado 2024 abr. 27 ] Available from: https://www.tib.eu/en/search/id/BLCP%3ACN015367308/On-the-evolution-of-Random-Boolean-Functions/
Vancouver
Bollobás B, Kohayakawa Y, Luczak T. On the evolution of random boolean functions [Internet]. Proceedings. 1994 ;[citado 2024 abr. 27 ] Available from: https://www.tib.eu/en/search/id/BLCP%3ACN015367308/On-the-evolution-of-Random-Boolean-Functions/
Artigo de periodico
On the diameter and radius of random subgraphs of the cube (1994)
Bollobás, Béla ; Kohayakawa, Yoshiharu ; Luczak, Tomasz
Source: Random Structures and Algorithms. Unidade: IME
Subjects: COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu e LUCZAK, Tomasz. On the diameter and radius of random subgraphs of the cube. Random Structures and Algorithms, v. 5, n. 5, p. 627-648, 1994Tradução . . Disponível em: https://doi.org/10.1002/rsa.3240050503. Acesso em: 27 abr. 2024.
APA
Bollobás, B., Kohayakawa, Y., & Luczak, T. (1994). On the diameter and radius of random subgraphs of the cube. Random Structures and Algorithms, 5( 5), 627-648. doi:10.1002/rsa.3240050503
NLM
Bollobás B, Kohayakawa Y, Luczak T. On the diameter and radius of random subgraphs of the cube [Internet]. Random Structures and Algorithms. 1994 ; 5( 5): 627-648.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1002/rsa.3240050503
Vancouver
Bollobás B, Kohayakawa Y, Luczak T. On the diameter and radius of random subgraphs of the cube [Internet]. Random Structures and Algorithms. 1994 ; 5( 5): 627-648.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1002/rsa.3240050503
Artigo de periodico
Percolation in high dimensions (1994)
Bollobás, Béla ; Kohayakawa, Yoshiharu
Source: European Journal of Combinatorics. Unidade: IME
Subjects: PERCOLAÇÃO, TEORIA DA PROBABILIDADE, PROCESSOS ESTOCÁSTICOS, COMBINATÓRIA, TEORIA DOS GRAFOS, MECÂNICA ESTATÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu. Percolation in high dimensions. European Journal of Combinatorics, v. 15, n. 2, p. 113-125, 1994Tradução . . Disponível em: https://doi.org/10.1006/eujc.1994.1014. Acesso em: 27 abr. 2024.
APA
Bollobás, B., & Kohayakawa, Y. (1994). Percolation in high dimensions. European Journal of Combinatorics, 15( 2), 113-125. doi:10.1006/eujc.1994.1014
NLM
Bollobás B, Kohayakawa Y. Percolation in high dimensions [Internet]. European Journal of Combinatorics. 1994 ; 15( 2): 113-125.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1006/eujc.1994.1014
Vancouver
Bollobás B, Kohayakawa Y. Percolation in high dimensions [Internet]. European Journal of Combinatorics. 1994 ; 15( 2): 113-125.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1006/eujc.1994.1014
Artigo de periodico
Evolution of random subgraphs of the cube (1992)
Bollobás, Béla ; Kohayakawa, Yoshiharu ; Luczak, Tomasz
Source: Random, Structures and Algorithms. Unidade: IME
Assunto: ALGORITMOS E ESTRUTURAS DE DADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu e LUCZAK, Tomasz. Evolution of random subgraphs of the cube. Random, Structures and Algorithms, v. 3 , n. 1 , p. 55-89, 1992Tradução . . Disponível em: https://doi.org/10.1002/rsa.3240030106. Acesso em: 27 abr. 2024.
APA
Bollobás, B., Kohayakawa, Y., & Luczak, T. (1992). Evolution of random subgraphs of the cube. Random, Structures and Algorithms, 3 ( 1 ), 55-89. doi:10.1002/rsa.3240030106
NLM
Bollobás B, Kohayakawa Y, Luczak T. Evolution of random subgraphs of the cube [Internet]. Random, Structures and Algorithms. 1992 ;3 ( 1 ): 55-89.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1002/rsa.3240030106
Vancouver
Bollobás B, Kohayakawa Y, Luczak T. Evolution of random subgraphs of the cube [Internet]. Random, Structures and Algorithms. 1992 ;3 ( 1 ): 55-89.[citado 2024 abr. 27 ] Available from: https://doi.org/10.1002/rsa.3240030106
Trabalho de evento
Hitting time of hamilton cycles in random bipartite graphs (1991)
Bollobás, Béla ; Kohayakawa, Yoshiharu
Source: Proceedings. Conference titles: International Conference in Graph Theory, Combinatorics, Algorithms and Applications. Unidade: IME
Assunto: TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu. Hitting time of hamilton cycles in random bipartite graphs. 1991, Anais.. Philadelphia: SIAM, 1991. . Acesso em: 27 abr. 2024.
APA
Bollobás, B., & Kohayakawa, Y. (1991). Hitting time of hamilton cycles in random bipartite graphs. In Proceedings. Philadelphia: SIAM.
NLM
Bollobás B, Kohayakawa Y. Hitting time of hamilton cycles in random bipartite graphs. Proceedings. 1991 ;[citado 2024 abr. 27 ]
Vancouver
Bollobás B, Kohayakawa Y. Hitting time of hamilton cycles in random bipartite graphs. Proceedings. 1991 ;[citado 2024 abr. 27 ]

USP Schools

ReP

Filtros

Authors

Date published

Subjects

Source title

Countries/Territories

Funding Agencies

Non normalized affiliation

Countries of institutions of collaboration